A Faster Isomorphism Test for Graphs of Small Degree
نویسندگان
چکیده
منابع مشابه
Towards faster isomorphism tests for bounded-degree graphs
Luks’s algorithm (JCSS 1982) to test isomorphism of bounded degree graphs in polynomial time is one of the most important results in the context of the Graph Isomorphism Problem and has been repeatedly used as a basic building block for many other algorithms. In particular, for graphs of logarithmic degree, Babai’s quasipolynomial isomorphism test (STOC 2016) essentially boils down to Luks’s al...
متن کاملIsomorphism of graphs-a polynomial test
Introduction-The question whether an isomorphism test for two graphs may be found, which is polynomial in the number of vertices, , n stands open for quite a while now. The purpose of the present article is to answer this question affirmatively by presenting an algorithm which decides whether two graphs are isomorphic or not and showing that the number of n independent elementary operations nee...
متن کاملDegree-constrained editing of small-degree graphs
This thesis deals with degree-constrained graph modification problems. In particular, we investigate the computational complexity of DAG Realization and Degree Anonymity. The DAG Realization problem is, given a multiset of positive integer pairs, to decide whether there is a realizing directed acyclic graph (DAG), that is, pairs are one-to-one assigned to vertices such that the indegree and the...
متن کاملFaster subtree isomorphism
We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no such subtree. We give an O( k1:5 logkn)time algorithm for this problem, where k and n are the number of vertices in H and G respectively. This improves over the O(k1:5n) algorithms of Chung and Matula. We also give a randomized (Las Vegas) O(min(k1:45n; kn1:43))...
متن کاملAn improved isomorphism test for bounded-tree-width graphs
We give a new fpt algorithm testing isomorphism of n-vertex graphs of tree width k in time 2 polylog(k) poly(n), improving the fpt algorithm due to Lokshtanov, Pilipczuk, Pilipczuk, and Saurabh (FOCS 2014), which runs in time 2 5 log k) poly(n). Based on an improved version of the isomorphism-invariant graph decomposition technique introduced by Lokshtanov et al., we prove restrictions on the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2020
ISSN: 0097-5397,1095-7111
DOI: 10.1137/19m1245293